Tightness of supercritical Liouville first passage percolation

نویسندگان

چکیده

Liouville first passage percolation (LFPP) with parameter $\xi >0$ is the family of random distance functions ${D\_h^\epsilon}{\epsilon >0}$ on plane obtained by integrating $e^{\xi h\epsilon}$ along paths, where $h\_\epsilon$ for $\epsilon a smooth mollification planar Gaussian free field. Previous work Ding–Dubédat–Dunlap–Falconet and Gwynne–Miller has shown that there critical value $\xi\_{\mathrm{crit}} > 0$ such < \xi\_{\mathrm{crit}}$, LFPP converges under appropriate re-scaling to metric which induces same topology as Euclidean (the so-called $\gamma$-Liouville quantum gravity $\gamma = \gamma(\xi)\in (0,2)$). We show all 0$, metrics are tight respect lower semicontinuous functions. For every possible subsequential limit $D\_h$ does not induce topology: rather, an uncountable, dense, Lebesgue measure-zero set points $z\in\mathbb C$ $D\_h(z,w) \infty$ $w\in\mathbb C\setminus {z}$. expect these limiting related matter central charge in $(1,25)$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diameters in Supercritical Random Graphs Via First Passage Percolation

We study the diameter of C1, the largest component of the Erdős-Rényi random graph G(n, p) emerging from the critical window, i.e., for p = 1+ε n where εn → ∞ and ε = o(1). This parameter was extensively studied for fixed ε > 0, yet results for ε = o(1) outside the critical window were only obtained very recently: Riordan and Wormald gave precise estimates on the diameter, however these do not ...

متن کامل

Tightness of Fluctuations of First Passage Percolation on Some Large Graphs

The theorem of Dekking and Host [6] regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces and the lamplighter graph over N. This class of graphs is closed under product with any bounded degree graph. Few open problems and conjectures are gath...

متن کامل

Monotonicity in first-passage percolation

We consider standard first-passage percolation on Zd. Let e1 be the first coordinate vector. Let a(n) be the expected passage time from the origin to ne1. In this short paper, we note that a(n) is increasing under some strong condition on the support of the distribution of the passage times on the edges.

متن کامل

Geodesics in First-Passage Percolation

We consider a wide class of ergodic first passage percolation processes on Z2 and prove that there exist at least four one-sided geodesics a.s. We also show that coexistence is possible with positive probability in a four color Richardson’s growth model. This improves earlier results of Häggström and Pemantle [9], Garet and Marchand [7] and Hoffman [11] who proved that first passage percolation...

متن کامل

First-passage percolation on width-two stretches

In this work we consider two first-passage percolation problems. In the first part we concern ourselves with effectively one-dimensional graphs with vertex set {1 . . . , n}×{0, 1} and translation-invariant edge-structure. For three of six non-trivial cases we obtain exact expressions for the asymptotic percolation rate χ by solving certain recursive distributional equations and invoking result...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the European Mathematical Society

سال: 2022

ISSN: ['1435-9855', '1435-9863']

DOI: https://doi.org/10.4171/jems/1273